The Alon-Tarsi number of a planar graph minus a matching
نویسندگان
چکیده
منابع مشابه
The Conjectures of Alon--Tarsi and Rota in Dimension Prime Minus One
A formula for Glynn’s hyperdeterminant detp (p prime) of a square matrix shows that the number of ways to decompose any integral doubly stochastic matrix with row and column sums p− 1 into p− 1 permutation matrices with even product, minus the number of ways with odd product, is 1 (mod p). It follows that the number of even Latin squares of order p− 1 is not equal to the number of odd Latin squ...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملOn two generalizations of the Alon-Tarsi polynomial method
In a seminal paper [6], Alon and Tarsi have introduced an algebraic technique for proving upper bounds on the choice number of graphs (and thus, in particular, upper bounds on their chromatic number). The upper bound on the choice number of G obtained via their method, was later coined the Alon-Tarsi number of G and was denoted by AT (G) (see e.g. [24]). They have provided a combinatorial inter...
متن کاملHypergraph Extension Of The Alon-Tarsi List Coloring Theorem
An Eulerian subgraph in a digraph is a subgraph in which indegree equals outdegree at each vertex. Alon and Tarsi [2] proved that a graph is d-choosable when it has an orientation that has no vertex of outdegree at least d and has the property that the numbers of Eulerian subgraphs with even-sized and odd-sized edge sets differ. We generalize this theorem to k-uniform hypergraphs, where k is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2020
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2020.02.005